Convex Games versus Clan Games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Games versus clan Games

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a “dualize and restrict”procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a “dualize and extend” pr...

متن کامل

Monotonic allocation schemes in clan games

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition re°ecting the decreasing marginal contribution of non-clan members to growing coalitions. This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation scheme, where the value of each coalition is divided over its members in such a way that the clan...

متن کامل

Locally Convex Games

We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Cooperative games with the unit marginal worth property are defined and characterizations of locally concave (convex) games with this property are proved. Moreover, we obtain a characterization of a subclass of locally conca...

متن کامل

Convex Interval Games

1 Institute of Applied Mathematics, Middle East Technical University, 06531 Ankara, Turkey 2 Department of Mathematics, Faculty of Arts and Sciences, Süleyman Demirel University, 32260 Isparta, Turkey 3 Faculty of Computer Science, Alexandru Ioan Cuza University, 700483 Iaşi, Romania 4 CentER and Department of Econometrics and OR, Tilburg University, P.O. Box 90153, 5000LE Tilburg, The Netherla...

متن کامل

Locally Convex (concave) Games

We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Moreover, we obtain a characterization of a subclass of locally concave games in terms of the rank function of a matroid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2006

ISSN: 1556-5068

DOI: 10.2139/ssrn.919811